Sequential Fixed-Point ICA Based on Mutual Information Minimization
نویسنده
چکیده
A new gradient technique is introduced for linear independent component analysis (ICA) based on the Edgeworth expansion of mutual information, for which the algorithm operates sequentially using fixed-point iterations. In order to address the adverse effect of outliers, a robust version of the Edgeworth expansion is adopted, in terms of robust cumulants, and robust derivatives of the Hermite polynomials are used. Also, a new constrained version of ICA is introduced, based on goal programming of mutual information objectives, which is applied to the extraction of the antepartum fetal electrocardiogram from multielectrode cutaneous recordings on the mother's thorax and abdomen.
منابع مشابه
Fast and robust fixed-point algorithms for independent component analysis
Independent component analysis (ICA) is a statistical method for transforming an observed multidimensional random vector into components that are statistically as independent from each other as possible. In this paper, we use a combination of two different approaches for linear ICA: Comon's information-theoretic approach and the projection pursuit approach. Using maximum entropy approximations ...
متن کاملIndependent Component Analysis Over Galois Fields
We consider the framework of Independent Component Analysis (ICA) for the case where the independent sources and their linear mixtures all reside in a Galois field of prime order P . Similarities and differences from the classical ICA framework (over the Real field) are explored. We show that a necessary and sufficient identifiability condition is that none of the sources should have a Uniform ...
متن کاملMutual information minimization: application to Blind Source Separation
In this paper, the problem of Blind Source Separation (BSS) through mutual information minimization is addressed. For mutual information minimization, multi-variate score functions are first introduced, which can be served to construct a non-parametric “gradient” for mutual information. Then, two general gradient based approaches for minimizing mutual information in a parametric model are prese...
متن کاملBlind Source Separation by Adaptive Estimation of Score Function Difference
In this paper, an adaptive algorithm for blind source separation in linear instantaneous mixtures is proposed, and it is shown to be the optimum version of the EASI algorithm. The algorithm is based on minimization of mutual information of outputs. This minimization is done using adaptive estimation of a recently proposed non-parametric “gradient” for mutual information.
متن کاملFlexible Ica in Complex and Nonlinear Environment by an Mutual Information Approach
This paper introduces an Independent Component Analysis (ICA) approach to the separation of nonlinear mixtures in the complex domain. Source separation is performed by the minimization of output mutual information (MMI approach). Nonlinear complex functions involved in the processing are realized by the so called “splitting functions” which work on the real and the imaginary part of the signal ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Neural computation
دوره 20 5 شماره
صفحات -
تاریخ انتشار 2008